Outer approximation algorithms for canonical DC problems
نویسندگان
چکیده
منابع مشابه
Outer approximation algorithms for canonical DC problems
The paper discusses a general framework for outer approximation type algorithms for the canonical DC optimization problem. A thorough analysis of properties which guarantee convergence is carried out: different sets of general conditions are proposed and compared. They are exploited to build six different algorithms, which include the first cutting plane algorithm proposed by Tuy but also new o...
متن کاملOuter Approximation Algorithms for Canonical Reverse-Polar Problems
In this paper we propose a novel generalization of the canonical DC problem and we study the convergence of outer approximation (cutting planes) algorithms for its solution which use an “approximated” oracle for checking the global optimality conditions to the problem. Although the approximated optimality conditions are similar to those of the canonical DC problem, the new class of Canonical Re...
متن کاملOuter approximation algorithms for DC programs and beyond
Acknowledgements This thesis is the result of four years of work whereby I have been accompanied and supported by many people. It is my pleasure that I have now the opportunity to express my gratitude to all of them. Without them, this dissertation would not have been possible. I would like to express my deep and sincere gratitude to my supervisors, Professors Giancarlo Bigi and Antonio Frangio...
متن کاملApproximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملApproximation Algorithms for Segmentation Problems
We introduce and study a novel genre of optimization problems, which we call segmentation problems, motivated in part by certain aspects of clustering and data mining. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. We focus on two natural and interesting (but MA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2009
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-009-9415-1